System and Method for Providing Buffer Inventory Profile in a Discrete Time Supply Chain Planner using a Nested Bucketization Structure

ABSTRACT

A system and method is disclosed for providing nested bucketization in a supply chain network. The system includes a server coupled with a database and configured to access data describing a time horizon of a specified time interval. The server is further configured to create an on-hand inventory profile which comprises a set of (day, quantity) pairs, stored in a linked list within a data structure involving nested buckets, wherein the on-hand inventory profile points to an empty link list when first created and store the on-hand inventory profile in the database.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present disclosure is related to that disclosed in the U.S. patent application Ser. No. 12/689,345, filed Jan. 20, 2010, entitled “System And Method For Providing Buffer Inventory Profile In A Discrete Time Supply Chain Planner Using A Nested Bucketization Structure” which claims priority under 35 U.S.C. §119(e) to U.S. Provisional Application No. 61/145,829, filed Jan. 20, 2009, entitled “Data Representation for Buffer Inventory Profile in a Discrete Time Supply Chain Planner using a Nested Bucketization Structure.” U.S. patent application Ser. No. 12/689,345 and U.S. Provisional Application No. 61/145,829 are assigned to the assignee of the present application. The subject matter disclosed in U.S. patent application Ser. No. 12/689,345 and U.S. Provisional Application No. 61/145,829 is hereby incorporated by reference into the present disclosure as if fully set forth herein.

TECHNICAL FIELD

This invention relates generally to a data structure, and more particularly to system and method for providing nested bucketization in a supply chain network.

BACKGROUND

In a supply chain network, one or more entities provide materials to one or more other entities that produce intermediate or finished goods. However, because of the increasing number of entities within the supply chain network, managing the inventory operations of, for example, on-hand inventory of the multiplicity of entities is too cumbersome. In addition, there is currently no specific data structure for the discrete time environment. The inability to effectively manage inventory operations and for the discrete time environment is undesirable.

SUMMARY

A system for providing nested bucketization in a supply chain network is disclosed. The system includes a database that stores data describing a time horizon of a specified time interval. The system further includes a server coupled with a database and configured to access the data describing the time horizon of the specified time interval. The server is further configured to create an on-hand inventory profile which comprises a set of (day, quantity) pairs, wherein the on-hand inventory profile points to an empty link list when first created and store the on-hand inventory profile in the database.

A method of nested bucketization is also disclosed. The method provides for accessing, by a computer, data describing a time horizon of a specified time interval. The method further provides for creating, by the computer, an on-hand inventory profile which comprises a set of (day, quantity) pairs, wherein the on-hand inventory profile points to an empty link list when first created and storing, by the computer, the on-hand inventory profile in a database.

A computer-readable medium embodied with software providing nested bucketization in a supply chain network is also disclosed. The software when executed using one or more computers is configured to access data describing a time horizon of a specified time interval. The software is further configured to create an on-hand inventory profile which comprises a set of (day, quantity) pairs, wherein the on-hand inventory profile points to an empty link list when first created and store the on-hand inventory profile in a database.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features believed characteristic of the invention are set forth in the appended claims. However, the invention itself, as well as a preferred mode of use, and further objectives and advantages thereof, will best be understood by reference to the following detailed description when read in conjunction with the accompanying drawings, wherein:

FIG. 1 illustrates an exemplary system according to a preferred embodiment;

FIG. 2 illustrates a nested data structure in accordance with the preferred embodiment;

FIG. 3 illustrates an exemplary method of implementing a nested bucketization in a supply chain network; and

FIG. 4 illustrates an exemplary method of managing an on-hand inventory profile using nested bucketization.

DETAILED DESCRIPTION

Reference will now be made to the following detailed description of the preferred and alternate embodiments. Those skilled in the art will recognize that the present invention provides many inventive concepts and novel features, that are merely illustrative, and are not to be construed as restrictive. Accordingly, the specific embodiments discussed herein are given by way of example and do not limit the scope of the present invention.

FIG. 1 illustrates an exemplary system according to a preferred embodiment. System 100 comprises supply chain planner 110, one or more entities 120 a-120 n, a network 130, and communication links 132 and 134 a-134 n. Although supply chain planner 110, one or more entities 120 a-120 n, and a single network 130, are shown and described; embodiments contemplate any number of supply chain planners 110, any number of entities 120 a-120 n, and/or any number of networks 130, according to particular needs. In addition, or as an alternative, supply chain planner 110 may be integral to or separate from the hardware and/or software of any one of the one or more entities 120 a-120 n.

In one embodiment, one or more entities 120 a-120 n represent one or more supply chain networks including one or more supply chain entities, such as, for example suppliers, manufacturers, distribution centers, retailers, and/or customers. A supplier may be any suitable entity that offers to sell or otherwise provides one or more items (i.e., materials, components, or products) to one or more manufacturers. A manufacturer may be any suitable entity that manufactures at least one finished good. A manufacturer may use one or more items during the manufacturing process to produce a finished good. In this document, the phrase “finished good” may refer to any manufactured, fabricated, assembled, or otherwise processed item, material, component, good or product. A finished good may represent an item ready to be supplied to, for example, another supply chain entity in system 100, such as a supplier, an item that needs further processing, or any other item. A manufacturer may, for example, produce and sell a finished good to a supplier, another manufacturer, a distribution center, a retailer, a customer, or any other suitable person or entity. A distribution center may be any suitable entity that offers to sell or otherwise distributes at least one finished good to one or more retailers and/or customers. A retailer may be any suitable entity that obtains one or more finished goods to sell to one or more customers.

Although one or more entities 120 a-120 n is shown and described as separate and distinct entities, the same person or entity can simultaneously act as any one of the one or more entities 120 a-120 n. For example, one or more entities 120 a-120 n acting as a manufacturer could produce a finished good, and the same entity could act as a supplier to supply an item to another supply chain. Although one example of a supply chain network is shown and described, embodiments contemplate any operational environment and/or supply chain network, without departing from the scope of the present invention.

Supply chain planner 110 comprises one or more computers 112, one or more servers 114, and one or more databases 118. In one embodiment, supply chain planner 110 and/or one or more entities 120 a-120 n may each operate on one or more computer systems including one or more computers 112 that are integral to or separate from the hardware and/or software that support system 100. These one or more computer systems may include any suitable input device, such as a keypad, mouse, touch screen, microphone, or other device to input information. An output device may convey information associated with the operation of supply chain planner 110 and one or more entities 120 a-120 n, including digital or analog data, visual information, or audio information. These one or more computer systems may include fixed or removable computer storage media, such as magnetic computer disks, CD-ROM, or other suitable computer-implemented storage media to receive output from and provide input to system 100. These one or more computer systems may include one or more processors and associated memory to execute instructions and manipulate information according to the operation of system 100. Each of these one or more computer systems may be a work station, personal computer (PC), network computer, notebook computer, personal digital assistant (PDA), cell phone, wireless device, telephone, wireless data port, or any other suitable computing device.

In one embodiment, the memory associated with these one or more computer systems comprise any of a variety of data structures, arrangements, and/or compilations configured to store and facilitate retrieval of information. The memory may, for example, comprise one or more volatile or non-volatile memory devices. Although the memory is described as residing within these one or more computer systems, the memory may reside in any location or locations that are accessible by one or more computers 112 or the one or more processors. The memory receives and stores information related to on-hand inventory information associated with, for example, one or more entities 120 a-120 n. The one or more processors processes information stored in the memory and generates and accesses on-hand inventory profiles associated with one or more entities 120 a-120 n. The memory stores and the one or more processors process any suitable information to perform one or more inventory operations associated with one or more entities 120 a-120 n.

One or more servers 110 comprise one or more planning engines 116. Although one or more servers 114 is shown and described as comprising one or more planning engines 116, embodiments contemplate any suitable engines, solvers, or combination of engines and/or solvers, according to particular needs. One or more databases 118 comprises one or more databases, one or more buffers, and/or one or more other data storage arrangements at one or more locations, local to, or remote from, one or more servers 114. One or more databases 220 may be coupled with one or more servers 114 using one or more local area networks (LANs), metropolitan area networks (MANs), wide area networks (WANs), network 130, such as, for example, the Internet, or any other appropriate wire line, wireless, or other links. As explained below in more detail, one or more databases 118 comprise one or more nested data structures that store inventory data and on-hand inventory information of one or more entities 120 a-120 n that may be used by one or more servers 114.

In an embodiment, one or more users may be associated with supply chain planner 110 and/or one or more entities 120 a-120 n. These one or more users may, for example, manage on-hand inventory profiles and/or one or more related operations of one or more entities 120 a-120 n. In one embodiment, these one or more related operations include retrieving on-hand inventory information, adding on-hand inventory information, and retrieving minimum on-hand inventory information, in a computational efficient manner. In addition, or as an alternative, these users within system 100 may include, for example, one or more computer systems programmed to autonomously handle inventory planning and/or one or more related operations within system 100. As discussed above, one or more servers 114 may support one or more planning engines 116, including one or more planning engines, which store and retrieve inventory profiles, on a buffer of one or more databases 118, including a set of (date, quantity) pairs, where ‘date’ is the date on which ‘quantity’ amount of material enters the on-hand inventory of this buffer.

In one embodiment, supply chain planner 110 is coupled with network 130 using communications link 132, which may be any wireline, wireless, or other link suitable to support data communications between supply chain planner 110 and network 130 during operation of system 100. One or more entities 120 a-120 n are coupled with network 130 using communications links 134 a-134 n, which may be any wireline, wireless, or other link suitable to support data communications between one or more entities 120 a-120 n and network 130 during operation of system 100. Although communication links 132 and 134 a-134 n are shown as generally coupling supply chain planner 110 and one or more entities 120 a-120 n to network 130, supply chain planner 110 and one or more entities 120 a-120 n may communicate directly with each other, according to particular needs.

In addition, or as an alternative, network 130 may include the Internet and any appropriate local area networks (LANs), metropolitan area networks (MANs), or wide area networks (WANs) coupling supply chain planner 110 and one or more entities 120 a-120 n. For example, data may be maintained by supply chain planner 110 at one or more locations external to supply chain planner 110 and one or more entities 120 a-120 n and made available to one or more associated users of one or more entities 120 a-120 n using network 130 or in any other appropriate manner. Those skilled in the art will recognize that the complete structure and operation of communication network 130 and other components within system 100 are not depicted or described. Embodiments may be employed in conjunction with known communications networks and other components.

In one embodiment and as discussed below, supply chain planner 110 provides for a computationally efficient nested data structure that stores on-hand inventory information on one or more buffers of one or more databases 118, in a discrete time environment, wherein time is unitised in, for example, days and the time horizon is upper bounded in terms of, for example, the number of days. In addition and as discussed in more detail below, supply chain planner 110 divides the time horizon into a set of nested buckets until a bucket's length is equal to a predetermined amount of time.

As an example only and not by way of limitation, the nested data structure supports the operations of retrieving the total on-hand inventory information available on a given day (cumulative quantity up to a day) and adding a set of (day, quantity) pairs on to the on-hand inventory profile. In one embodiment, supply chain planner 110 can perform these operations in time O(log(N)) in worst case, where N is the number of (day, quantity) pairs (which is upper bounded by the number of days in the time horizon). As another example, the nested data structure supports the operations of retrieving all days (with their quantities) on which the total on-hand inventory information falls below a certain level and retrieving the minimum on-hand inventory information after a given day. In one embodiment, supply chain planner 110 can perform these operations in time O(N), since, for example, in the worst case all days of the time horizon could have their on-hand inventory information below the specified level and so no data structure can guarantee anything better.

FIG. 2 illustrates a nested data structure 200 in accordance with the preferred embodiment. Nested data structure 200 comprises a time horizon 210 of a specified time interval, such as, for example, length T days. As discussed in more detail below, supply chain planner 110 divides time horizon 210 into m equal length buckets 220, 230, and 240, which as discussed in more detail below the optimal value for m is 3. In one embodiment, and as discussed below, m=3. In one embodiment, the length of each bucket 220 and 230 (except the last bucket 240) is the ceiling (upper integer) of T/m. In addition, or as an alternative, each of buckets 220, 230, and 240 may be further sub-divided into m equal length buckets 250, 260, and 270 (so that each of buckets 250, 260, and 270 length is T/m²). Embodiments provide for dividing the bucket's until a bucket's length is equal to a predetermined amount of time, such as for example, one day. In addition, or as an alternative, at a leaf bucket 230 and 240 (i.e. a bucket which is not sub-divided into further buckets), a set of (day, quantity) pairs are stored in a linked list format. Although a particular nested data structure 200 is shown and described; embodiments contemplate any number of buckets, and/or any number of levels, according to particular needs.

FIG. 3 illustrates an exemplary method 300 of implementing a nested bucketization in a supply chain network. Supply chain planner 110 begins the method at step 302 by dividing time horizon 210 (of, for example, length T days) into m equal length bucket's wherein the optimal value for m is 3, thereby dividing time horizon 210 into m equal length buckets 220, 230, and 240. At step 304, supply chain planner 110 determines the length of each bucket 220 and 230 (except the last) is the ceiling (upper integer) of T/m. In addition, each of buckets 220, 230, and 240 may hold additional information, such as, for example, the starting on-hand inventory, minimum on-hand inventory, and maximum on-hand inventory information for that bucket. At step 306, supply chain planner 110 further sub-divides each of buckets 220, 230, and 240 into m equal length buckets, that is, each bucket's length is T/m². Supply chain planner 110 continues to divide the bucket's length until a bucket's length is equal to a predetermined amount of time, such as for example, one day.

At step 308, supply chain planner 110 stores a set of (day, quantity) pairs in a linked list format at each leaf bucket 230 and 240 (i.e. a bucket which is not sub-divided into further buckets) and the method ends. In addition, although, FIG. 3 illustrates one embodiment of a method of implementing a nested bucketization in a supply chain network, various changes may be made to method 300 without departing from the scope of embodiments of the present invention.

FIG. 4 illustrates an exemplary method 400 of managing an on-hand inventory profile using nested bucketization. Supply chain planner 110 begins the method at step 402 by creating an on-hand inventory profile which comprises a set of (day, quantity) pairs where ‘date’ is the date on which ‘quantity’ amount of material enters the on-hand inventory of this buffer. In addition, when the on-hand inventory profile is first created it points to an empty linked list. At step 404, supply chain planner 110 adds more sets of (day, quantity) pairs to the on-hand inventory profile, the sets of (day, quantity) pairs are inserted into the linked list. In one embodiment, supply chain planner 110 inserts the set of (day, quantity) pairs into the linked list in a sorted manner (such as, for example, sorted in ascending order of days). In addition, for all nodes in the linked list beyond the current node, supply chain planner 110 increases the quantity of the on-hand inventory, since on-hand inventory is the net quantity present in inventory on a given day.

At step 406, supply chain planner 110 determines if the size of the linked list exceeds m. If the size of the linked list exceeds m, the method proceeds to step 408, otherwise, the methods proceeds to step 412. At step 408, supply chain planner 110 divides the time horizon 210 into m buckets. At step 410, supply chain planner 110 adds the existing set of (day, quantity) pairs to the appropriate buckets and stores the existing set of (day, quantity) pairs within the buckets in separate linked lists.

At step 412, supply chain planner 110 adds the next set of (day, quantity) pairs to the on-hand inventory profile by adding it to the linked list within the appropriate bucket as discussed above. In one embodiment, because the bucket lengths are constant, supply chain planner 110 identifies the appropriate bucket in time O(1). In addition, or as an alternative, for all buckets after the current bucket, supply chain planner 110 augments the starting on-hand inventory of each of those buckets by quantity. In addition, as soon as any linked list grows beyond the size m, supply chain planner 110 sub-divides that bucket into further buckets. In the worst case, and as shown in FIG. 2 nested bucketization can go on until the depth of nestedness is log_(m)T.

Furthermore, when supply chain planner 110 adds a new set of (day, quantity) pairs to the on-hand inventory profile, supply chain planner 110 first identifies the appropriate leaf node bucket (in the worst case, this can take O(log_(m)T) time, since that is the worst case depth of nestedness). In addition, insertion of the set of (day, quantity) pairs to that bucket requires supply chain planner 110 to search all nodes in the linked list before ‘day’ (to identify the position to insert) and subsequent updation of nodes after ‘day’. In one embodiment, this takes a constant time of ‘m’. Thereafter, supply chain planner 110 updates the starting on-hand inventory of all buckets after this bucket which requires updation of buckets after current bucket, updation of buckets after the parent bucket of current bucket and so on until the top level of nestedness i.e. supply chain planner 110 traverses the depth of the nestedness and at each level, updates all the buckets after the current bucket. This requires (in the worst case), O(m*log_(m)T) time. In one embodiment, once supply chain planner 110 updates the starting on-hand inventory of a later bucket, there is no need for supply chain planner 110 to traverse down within the sub-buckets of that later bucket to update their starting on-hand inventory. Thus, in the worst case, adding on-hand inventory can take O(m*log_(m)T) time.

At step 414, supply chain planner 110 receives a query from one or more entities 120 a-120 n to access on-hand inventory on a given day. At step 416, supply chain planner 110 first identifies, similar to the insertion step 404, the appropriate leaf node bucket in O(log_(m)T) time. At step 418, supply chain planner 110 traverses the linked list present in this bucket to identify the on-hand inventory on the given day (in one embodiment, if there is no entry corresponding to that day, supply chain planner 110 selects the on-hand inventory entry on the latest day before that day and if no such entry is present supply chain planner 110 selects zero). This takes a constant time of m (in the worst case). In addition, supply chain planner 110 augments the on-hand inventory so obtained from the linked list node with the starting on-hand inventory of all buckets traversed while identifying this bucket. In one embodiment, this is the starting on-hand inventory of current bucket, its parent bucket, then that bucket's parent and so on until top level bucket is reached. In addition, or as an alternative, this step may be performed simultaneously during the process of identifying the leaf node bucket corresponding to ‘day’. Thus, in the worst case, the net time taken for this query is O(log_(m)T) time. In addition, if the number of add on-hand inventory operations is more than the query for on-hand inventory, it is attempted to minimize O(m*log_(m)T) time over m, i.e., this happens for m=3.

In one embodiment, for the purpose of identifying the minimum on-hand inventory after a given day and as discussed above minimum on-hand inventory information is stored within each nested bucket. In addition, maintaining this information does not add to the complexity of nested data structure 200, but allows the minimum on-hand inventory in a time range to be queried in O(m*log_(m)T) time. In another embodiment, for the purpose of identifying the maximum on-hand inventory after a given day and as discussed above maximum on-hand inventory information is stored in each nested bucket. In addition, supply chain planner 110 can also implement a query to receive all on-hand inventories less than a given level after a given day, even though its performance will be only in O(T) time. In addition, or as an alternative, a continuous time line can also be divided into nested buckets (the maximum depth of nestedness can be controlled as a parameter) and the continuous time line nested data structure can be embedded at the leaf bucket.

At step 420, supply chain planner 110 communicates the results of the query to one or more entities 120 a-120 n and the method ends. In addition, although, FIG. 4 illustrates one embodiment of a method of managing an on-hand inventory profile using nested bucketization, various changes may be made to method 300 without departing from the scope of embodiments of the present invention.

Reference in the foregoing specification to “one embodiment”, “an embodiment”, or “another embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.

While the exemplary embodiments have been shown and described, it will be understood that various changes and modifications to the foregoing embodiments may become apparent to those skilled in the art without departing from the spirit and scope of the present invention. 

1-19. (canceled)
 20. A system comprising: a supply chain network comprising one or more supply chain entities having an on-hand inventory of one or more items; a computer comprising a processor and memory configured to update an on-hand inventory by: receiving, from a database, a plurality of parent and leaf buckets comprising an on-hand inventory value and at least one leaf bucket comprising a linked list; inserting a (day, quantity) pair into a current leaf bucket of the plurality of leaf buckets corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; adding the quantity specified by quantity of the (day, quantity) pair to each quantity of any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; adding the quantity specified by the quantity of the (day, quantity) pair to each bucket after the current leaf bucket and all buckets after all parent buckets in each level of nestedness; and updating the on-hand inventory according to the insertion of the (day, quantity) pair; and a supplier of the supply chain network that ships one or more items to the one or more supply chain entities based, at least in part, on the updated on-hand inventory.
 21. The system of claim 20, wherein the linked list comprises a number of (day, quantity) pairs less than or equal to a value, m, and each of the plurality of parent and leaf buckets comprises a length less than or equal to a time horizon divided by the value, m.
 22. The system of claim 21, wherein inserting the (day, quantity) pair into the current leaf bucket comprises: when a linked list in the current leaf bucket does not exceed size m−1, inserting the (day, quantity) pair into the current leaf bucket corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; and when the linked list in the current leaf bucket exceeds size m−1, dividing the current leaf bucket into m number of further leaf buckets and inserting the (day, quantity) pair into one of the further leaf buckets corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the further leaf bucket which come before the time specified by day of the (day, quantity) pair.
 23. The system of claim 21, wherein the on-hand inventory comprises one or more of starting on-hand inventory, maximum on-hand inventory, and minimum on-hand inventory.
 24. The system of claim 21, wherein the computer further: generates a total of on-hand inventory for a queried time by: when a (day, quantity) pair corresponds to the queried time, retrieves the total on-hand inventory for the queried time; and when no (day, quantity) pair corresponds to the queried time and when a (day, quantity) pair corresponds to a time before the queried time, retrieves the total on-hand inventory for the time corresponding to the (day, quantity) pair corresponding to the time before the queried time.
 25. The system of claim 21, wherein the computer further: retrieves a listing of all days with quantities for which the on-hand inventory falls below a predetermined level.
 26. The system of claim 21, wherein m is an integer and the time horizon is discontinuous or m is any number and the time horizon is continuous.
 27. A method, comprising: receiving, by a computer, a plurality of parent and leaf buckets comprising an on-hand inventory of one or more supply chain entities in a supply chain network and at least one leaf bucket comprising a linked list; inserting, by the computer, a (day, quantity) pair into a current leaf bucket of the plurality of leaf buckets corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; adding, by the computer, the quantity specified by quantity of the (day, quantity) pair to each quantity of any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; adding, by the computer, the quantity specified by the quantity of the (day, quantity) pair to each bucket after the current leaf bucket and all buckets after all parent buckets in each level of nestedness; updating, by the computer, the on-hand inventory according to the insertion of the (day, quantity) pair; and shipping, by a supplier, one or more items to the one or more supply chain entities based, at least in part, on the updated on-hand inventory.
 28. The method of claim 27, wherein the linked list comprises a number of (day, quantity) pairs less than or equal to a value, m, and each of the plurality of parent and leaf buckets comprises a length less than or equal to a time horizon divided by the value, m.
 29. The method of claim 28, wherein inserting, by the computer, the (day, quantity) pair into the current leaf bucket comprises: when a linked list in the current leaf bucket does not exceed size m−1, inserting, by the computer, the (day, quantity) pair into the current leaf bucket corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; and when the linked list in the current leaf bucket exceeds size m−1, dividing, by the computer, the current leaf bucket into m number of further leaf buckets and inserting, by the computer, the (day, quantity) pair into one of the further leaf buckets corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the further leaf bucket which come before the time specified by day of the (day, quantity) pair.
 30. The method of claim 28, wherein the on-hand inventory comprises one or more of starting on-hand inventory, maximum on-hand inventory, and minimum on-hand inventory.
 31. The method of claim 28, further comprising: generating, by the computer, a total of on-hand inventory for a queried time by: when a (day, quantity) pair corresponds to the queried time, retrieving, by the computer, the total on-hand inventory for the queried time; and when no (day, quantity) pair corresponds to the queried time and when a (day, quantity) pair corresponds to a time before the queried time, retrieving, by the computer, the total on-hand inventory for the time corresponding to the (day, quantity) pair corresponding to the time before the queried time.
 32. The method of claim 28, further comprising: retrieving, by the computer, a listing of all days with quantities for which the on-hand inventory falls below a predetermined level.
 33. The method of claim 28, wherein m is an integer and the time horizon is discontinuous or m is any number and the time horizon is continuous.
 34. A non-transitory computer-readable storage medium embodied with software, the software when executed using one or more computers is configured to: receive a plurality of parent and leaf buckets comprising an on-hand inventory of one or more supply chain entities in a supply chain network and at least one leaf bucket comprising a linked list; store a plurality of parent and leaf buckets comprising an on-hand inventory and at least one leaf bucket comprising a linked list; insert a (day, quantity) pair into a current leaf bucket of the plurality of leaf buckets corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; add the quantity specified by quantity of the (day, quantity) pair to each quantity of any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; add the quantity specified by the quantity of the (day, quantity) pair to each bucket after the current leaf bucket and all buckets after all parent buckets in each level of nestedness; update the on-hand inventory according to the insertion of the (day, quantity) pair; and ship one or more items to the one or more supply chain entities based, at least in part, on the updated on-hand inventory.
 35. The non-transitory computer-readable medium of claim 34, wherein the linked list comprises a number of (day, quantity) pairs less than or equal to a value, m, and each of the plurality of parent and leaf buckets comprises a length less than or equal to a time horizon divided by the value, m.
 36. The non-transitory computer-readable medium of claim 35, wherein the software is configured to insert the (day, quantity) pair into the current leaf bucket by: when a linked list in the current leaf bucket does not exceed size m−1, insert the (day, quantity) pair into the current leaf bucket corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the current leaf bucket which come before the time specified by day of the (day, quantity) pair; and when the linked list in the current leaf bucket exceeds size m−1, divide the current leaf bucket into m number of further leaf buckets and insert the (day, quantity) pair into one of the further leaf buckets corresponding to a time period covering the time specified by day of the (day, quantity) pair after any nodes in the further leaf bucket which come before the time specified by day of the (day, quantity) pair.
 37. The non-transitory computer-readable medium of claim 35, wherein the on-hand inventory comprises one or more of starting on-hand inventory, maximum on-hand inventory, and minimum on-hand inventory.
 38. The non-transitory computer-readable medium of claim 35, wherein the software is further configured to: generate a total of on-hand inventory for a queried time by: when a (day, quantity) pair corresponds to the queried time, retrieve the total on-hand inventory for the queried time; and when no (day, quantity) pair corresponds to the queried time and when a (day, quantity) pair corresponds to a time before the queried time, retrieve the total on-hand inventory for the time corresponding to the (day, quantity) pair corresponding to the time before the queried time.
 39. The non-transitory computer-readable medium of claim 35, wherein the software is further configured to: retrieve a listing of all days with quantities for which the on-hand inventory falls below a predetermined level. 